On nowhere dense graphs
نویسندگان
چکیده
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct vertices of A have distance at most 2d. This notion was isolated in the context of finite model theory by Gurevich and recently it played a prominent role in the study of homomorphism preservation theorems for special classes of structures (such as minor closed families). This in turn led to the notions of wide, semiwide and quasi-wide classes of graphs. It has been proved previously that minor closed classes and classes of graphs with locally forbidden minors are examples of such classes and thus (relativised) homomorphism preservation theorem holds for them. In this paper we show that (more general) classes with bounded expansion and (newly defined) classes with bounded local expansion and even (very general) classes of nowhere dense graphs are quasi wide. This not only strictly generalizes the previous results and solves several open problems but it also provides new proofs. It appears that bounded expansion and nowhere dense classes are perhaps a proper setting for investigation of wide-type classes as in several instances we obtain a structural characterization. This also puts classes of bounded expansion in the new context and we are able to prove a trichotomy result which separates classes of graphs which are dense (somewhere dense), nowhere dense and finite. Our motivation stems from finite dualities. As a corollary we obtain that any homomorphism closed first order definable property restricted to a bounded expansion class is a duality. ∗Supported by grant 1M0021620808 of the Czech Ministry of Education and AEOLUS †Department of Applied Mathematics and Institute of Theoretical Computer Science (ITI), Charles University, Malostranské nám.25, 11800 Praha 1, Czech Republic, [email protected] ‡Centre d’Analyse et de Mathématiques Sociales, CNRS, UMR 8557, 54 Bd Raspail, 75006 Paris, France, [email protected]
منابع مشابه
Characterisations of Nowhere Dense Graphs
Nowhere dense classes of graphs were introduced by Nešetřil and Ossona de Mendez as a model for “sparsity” in graphs. It turns out that nowhere dense classes of graphs can be characterised in many different ways and have been shown to be equivalent to other concepts studied in areas such as (finite) model theory. Therefore, the concept of nowhere density seems to capture a natural property of g...
متن کاملOn nowhere dense and somewhere dense - a graph trichotomy
Motivated by structural decompositions and other asymptotic properties of graphs we define the notions in the title and show the wide spectrum of examples of nowhere dense graphs. This has several algorithmic consequences and it generalizes and improves earlier results.
متن کاملOn the number of types in sparse graphs
We prove that for every class of graphs C which is nowhere dense, as defined by Nešetřil and Ossona de Mendez [27, 28], and for every first order formula φ(x̄, ȳ), whenever one draws a graph G ∈ C and a subset of its nodes A, the number of subsets of A|ȳ| which are of the form {v̄ ∈ A|ȳ| : G |= φ(ū, v̄)} for some valuation ū of x̄ in G is bounded by O(|A||x̄|+ε), for every ε > 0. This provides optim...
متن کاملParameterized Complexity of First-Order Logic
We show that if C is a class of graphs which is nowhere dense then rst-order model-checking is xed-parameter tractable on C. As all graph classes which exclude a xed minor, or are of bounded local tree-width or locally exclude a minor are nowhere dense, this generalises algorithmic meta-theorems obtained for these classes in the past (see [11, 13, 4]). Conversely, if C is not nowhere dense and ...
متن کاملEnumeration for FOQueries over Nowhere Dense Graphs
We consider the evaluation of first-order queries over classes of databases that are nowhere dense. The notion of nowhere dense classes was introduced by Nešetřil and Ossona de Mendez as a formalization of classes of “sparse” graphs and generalizes many well-known classes of graphs, such as classes of bounded degree, bounded treewidth, or bounded expansion. It has recently been shown by Grohe, ...
متن کاملNeighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs
We prove that whenever G is a graph from a nowhere dense graph class C, and A is a subset of vertices of G, then the number of subsets of A that are realized as intersections of A with r-neighborhoods of vertices of G is at most f(r, ε) · |A|, where r is any positive integer, ε is any positive real, and f is a function that depends only on the class C. This yields a characterization of nowhere ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 32 شماره
صفحات -
تاریخ انتشار 2011